The sums of the reciprocals of Fibonacci polynomials and Lucas polynomials
نویسندگان
چکیده
منابع مشابه
Generalized Fibonacci and Lucas Polynomials and Their Associated Diagonal Polynomials
Horadam [7], in a recent article, defined two sequences of polynomials Jn(x) and j„(x), the Jacobsthal and Jacobsthal-Lucas polynomials, respectively, and studied their properties. In the same article, he also defined and studied the properties of the rising and descending polynomials i^(x), rn(x), Dn(x)y and dn(x), which are fashioned in a manner similar to those for Chebyshev, Fermat, and oth...
متن کاملOn Bivariate Complex Fibonacci and Lucas Polynomials
In this study we define and study the Bivariate Complex Fibonacci and Bivariate Complex Lucas Polynomials. We give generating function, Binet formula, explicit formula and partial derivation of these polynomials. By defining these bivariate polynomials for special cases Fn(x, 1) is the complex Fibonacci polynomials and Fn(1, 1) is the complex Fibonacci numbers. Finally in the last section we gi...
متن کاملOn convolved generalized Fibonacci and Lucas polynomials
We define the convolved hðxÞ-Fibonacci polynomials as an extension of the classical con-volved Fibonacci numbers. Then we give some combinatorial formulas involving the hðxÞ-Fibonacci and hðxÞ-Lucas polynomials. Moreover we obtain the convolved hðxÞ-Fibo-nacci polynomials from a family of Hessenberg matrices. Fibonacci numbers and their generalizations have many interesting properties and appli...
متن کاملOn the Expansion of Fibonacci and Lucas Polynomials
Recently, Belbachir and Bencherif have expanded Fibonacci and Lucas polynomials using bases of Fibonacci-and Lucas-like polynomials. Here, we provide simplified proofs for the expansion formulaethat in essence a computer can do. Furthermore, for 2 of the 5 instances, we find q-analogues.
متن کاملSums of Reciprocals of Polynomials over Finite Fields
Consider the following example (typical in college algebra): 1 x2 + 1 x2 + 1 + 1 x2 + x + 1 x2 + x+ 1 = 4x + 6x + 8x + 6x + 3x+ 1 x2(x+ 1) (x2 + 1) (x2 + x+ 1) . Now let’s assume that all the coefficients in the above are from the binary field F2 = Z2 = {0, 1}. The result becomes much cleaner: 1 x2 + 1 x2 + 1 + 1 x2 + x + 1 x2 + x+ 1 = 1 (x2 + x)(x4 + x) . After a brief introduction to finite f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2012
ISSN: 1029-242X
DOI: 10.1186/1029-242x-2012-134